منابع مشابه
Searching for Parts and Services on the Web
The World Wide Web is a rich repository of information. However, the Web is primarily designed for human users, and maintains the majority of its information in textual form. This makes reliable and efficient ways of retrieving and extracting that information from the Web difficult. Textual information has some structure, but it is not readily accessible through traditional database techniques....
متن کاملMulti-target Ray Searching Problems
We consider the problem of exploring m concurrent rays using a single searcher. The rays are disjoint with the exception of a single common point, and in each ray a potential target may be located. The objective is to design efficient search strategies for locating t targets (with t ≤ m). This setting generalizes the extensively studied ray search (or star search) problem, in which the searcher...
متن کاملBiologic therapy for psoriasis - still searching for the best target*
Psoriasis is a chronic skin disease that results from the complex interaction between genetic and environmental factors. Over the last few decades, scientific evidence has redirected the focus of therapeutic studies to the immunologic pathways underlying its pathogenesis. This led to the biologic boom that we are currently experiencing, with the development and approval of targeted progressivel...
متن کاملSearching a Target with a Mobile Robot
This paper presents an application of the Markov Decision Processes to search a target with a mobile robot. The robot does not know the absolute position of the target. It only knows the position of the target relative to its position. Markov Decision Processes have been widely used in mobile robotics. In this paper, we show experimentally that they are well suited for our task. Moreover, we ex...
متن کاملSearching strategies for target discovery in wireless networks
In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members using the minimum cost, should we search the network only once, or should we apply a so-called “expansion ring scheme?” Specifically, how many searching attempt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2011
ISSN: 1534-7362
DOI: 10.1167/11.11.1321